package com.tgy.algorithm.base;


public class _堆排序03 {

    public static void heapInsert(int[] nums,int index) {

        while (true) {
            int parent = (index - 1) / 2;
            if(nums[index] <= nums[parent]) {
                break;
            }
        }
    }

    public static void main(String[] args) {

    }
}
